Using Transitive-Closure Logic for Deciding Linear Properties of Monoids
نویسندگان
چکیده
منابع مشابه
Logics for Classes of Boolean Monoids
This paper presents the algebraic and Kripke model soundness and completeness of a logic over Boolean monoids. An additional axiom added to the logic will cause the resulting monoid models to be representable as monoids of relations. A star operator, interpreted as reflexive, transitive closure, is conservatively added to the logic. The star operator is a relative modal operator, i.e., one that...
متن کاملDecidability of SHI with Transitive Closure of Roles
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. We show that SHI+ is decidable by devising a terminating, sound and complete algorithm for deciding satisfiability of concepts in SHI+ with r...
متن کاملDeciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by Boolean combinations of polynomial inequalities. We are in particular interested in deciding the termination of the evaluation of queries expressible in these transitive-closure logics. It turns out that termination is ...
متن کاملLinear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension
We consider n-dimensional semi-algebraic spatial databases. We compute in first-order logic extended with a transitive closure operator, a linear spatial database which characterizes the semi-algebraic spatial database up to a homeomorphism. In this way, we generalize our earlier results to semi-algebraic spatial databases in arbitrary dimensions, our earlier results being true for only two dim...
متن کاملProperties of Binary Transitive Closure Logics over Trees
Binary transitive closure logic (FO∗ for short) is the extension of first-order predicate logic by a transitive closure operator of binary relations. Deterministic binary transitive closure logic (FOD∗) is the restriction of FO∗ to deterministic transitive closures. It is known that these logics are more powerful than FO on arbitrary structures and on finite ordered trees. It is also known that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003